Higher-Order Deflation for Polynomial Systems with Isolated Singular Solutions
نویسندگان
چکیده
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton’s method. Using first-order derivatives of the polynomials in the system, our method creates an augmented system of equations which has the multiple isolated solution of the original system as a regular root. In this paper we consider two approaches to computing the “multiplicity structure” at a singular isolated solution. An idea coming from one of them gives rise to our new higher-order deflation method. Using higherorder partial derivatives of the original polynomials, the new algorithm reduces the multiplicity faster than our first method for systems which require several first-order deflation steps. 2000 Mathematics Subject Classification. Primary 65H10. Secondary 14Q99, 68W30.
منابع مشابه
Evaluation of Jacobian Matrices for Newton’s Method with Deflation to approximate Isolated Singular Solutions of Polynomial Systems
For isolated singular solutions of polynomial systems, we can restore the quadratic convergence of Newton’s method by deflation. The number of deflation stages is bounded by the multiplicity of the root. A preliminary implementation performs well in case only a few deflation stages are needed, but suffers from expression swell as the number of deflation stages grows. In this paper we describe h...
متن کاملOn deflation and multiplicity structure
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the Jacobian matrix of the input, and defines the deflated system by applying this differential form to the original system. The advantages of this new deflation is ...
متن کاملVerified Error Bounds for Isolated Singular Solutions of Polynomial Systems
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly perturbed system is guaranteed to possess an isolated singular solution within the computed bounds. Our new verification method is based on deflation techniques...
متن کاملNewton's method with deflation for isolated singularities of polynomial systems
We present a modification of Newton’s method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution as a regular root. We show that the number of deflation stages is bounded by the multiplicity of the isolated root. Our implementation performs well on a la...
متن کاملSe p 20 08 Sweeping Algebraic Curves for Singular Solutions ∗
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the solution paths. A point along a solution path is critical when the Jacobian matrix is rank deficient. The simplest case of quadratic turning points is well und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007